An efficient ordering algorithm to improve sparse vector methods
نویسندگان
چکیده
منابع مشابه
An Efficient Algorithm for Sparse Representations
Basis Pursuit (BP) and Basis Pursuit Denoising (BPDN), well established techniques for computing sparse representations, minimize an ` data fidelity term, subject to an ` sparsity constraint or regularization term, by mapping the problem to a linear or quadratic program. BPDN with an ` data fidelity term has recently been proposed, also implemented via a mapping to a linear program. We introduc...
متن کاملAn approach to Improve Particle Swarm Optimization Algorithm Using CUDA
The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...
متن کاملSparse Matrix Ordering Methods for Interior Point
The main cost of solving a linear programming problem using an interior point method is usually the cost of solving a series of sparse, symmetric linear systems of equations, AA T x = b. These systems are typically solved using a sparse direct method. The rst step in such a method is a reordering of the rows and columns of the matrix to reduce ll in the factor and/or reduce the required work. T...
متن کاملAn Efficient Algorithm for Raster-to-Vector Data Conversion
! Sla te Key Labor:uory of Sate lli te Ocean Env ironment DYIl<l mics, Seco nd Insti tu te of Oceanography, Slate Occ,mic Admi ni s tr:llion , H:lllgzhou.31 00 t 2, C hina E-mail: htgis@163 .com ~ Department of Geogmphy and Anthropology, Loui siana Slate Univers it y. Balon Rouge , LA 70803, USA; 3 Insti tute o r Remot e Sensing and Geographic:!l Informat ion Systems, Peking University. Beijing...
متن کاملAn Efficient Causal Ordering Algorithm for Mobile Computing Environments
Causal message ordering is required for several distributed applications. In order to preserve causal ordering, only direct dependency information between messages, with respect to the destination process(es), should be sent with each message. By eliminating other kinds of control information from the messages, the communication overheads can be signiicantly reduced. In this paper we present an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 1988
ISSN: 0885-8950
DOI: 10.1109/59.192963